Average Case Analysis of Multichannel Basis Pursuit

نویسندگان

  • Holger Rauhut
  • Yonina C. Eldar
چکیده

We consider the recovery of jointly sparse multichannel signals from incomplete measurements using convex relaxation methods. Worst case analysis is not able to provide insights into why joint sparse recovery is superior to applying standard sparse reconstruction methods to each channel individually. Therefore, we analyze an average case by imposing a probability model on the measured signals. We show that under a very mild condition on the sparsity and on the dictionary characteristics, measured for example by the coherence, the probability of recovery failure decays exponentially in the number of channels. This demonstrates that most of the time, multichannel sparse recovery is indeed superior to single channel methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Recovery

List of included articles [1] H. Rauhut. Random sampling of sparse trigonometric polynomials. Appl. Comput. [2] S. Kunis and H. Rauhut. Random sampling of sparse trigonometric polynomials II-orthogonal matching pursuit versus basis pursuit. [3] H. Rauhut. Stability results for random sampling of sparse trigonometric polynomi-als. [4] H. Rauhut. On the impossibility of uniform sparse reconstruct...

متن کامل

BASIS PURSUIT BASED GENETIC ALGORITHM FOR DAMAGE IDENTIFICATION

In damage detection the number of elements is generally more than the number of measured frequencies. Consequently, the corresponding damage detection equation is undetermined and thus has infinite solutions. Since in the damaged structures most of their elements remain healthy, the sparsest solution for the damage detection equation is mostly the actual damage. In the proposed method, the dama...

متن کامل

Sparsity according to Prony, average performance analysis

Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. Traditional approaches such as Basis Pursuit are based on relaxing a nonconvex `0-minimization problem [1]–[3]. In [4], a new polynomial complexity algorithm, ProSparse, is presented. ProSparse solves the sparse representation problem when the dictionary is the union...

متن کامل

Atoms of All Channels, Unite! Average Case Analysis of Multi-channel Sparse Recovery Using Greedy Algorithms

This paper provides new results on computing simultaneous sparse approximations of multichannel signals over redundant dictionaries using two greedy algorithms. The first one, p-thresholding, selects the S atoms that have the largest p-correlation while the second one, p-simultaneous matching pursuit (p-SOMP), is a generalisation of an algorithm studied by Tropp in [28]. We first provide exact ...

متن کامل

RIP-Based Near-Oracle Performance Guarantees for Subspace-Pursuit, CoSaMP, and Iterative Hard-Thresholding

This paper presents an average case denoising performance analysis for the Subspace Pursuit (SP), the CoSaMP and the IHT algorithms. This analysis considers the recovery of a noisy signal, with the assumptions that (i) it is corrupted by an additive random white Gaussian noise; and (ii) it has a Ksparse representation with respect to a known dictionary D. The proposed analysis is based on the R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009